package com.vint.mi;


/**
 * 1. hard
 * 2. 最小连续元素个数，一个数组和给定值，求最小连续元素个数之和大于或等于给点值
 */
public class Mi76 {
    private static String solution(String line){
        String[] src = line.split(";");
        int value = Integer.parseInt(src[0]);
        String[] src2 = src[2].split(",");
        int[] sarry = new int[src2.length];
        for(int i=0; i<src2.length; i++){
            sarry[i] = Integer.parseInt(src2[i]);
        }
        return Integer.toString(minSum(sarry,value));
    }

    private static int minSum(int[] src, int value){
        int ret = 0;
        return ret;
    }
    public static void main(String[] args) {
        System.out.println(solution("905"));
        System.out.println(solution("11"));
        System.out.println(solution("12"));
        System.out.println(solution("10"));
        System.out.println(solution("565"));
    }
}
